Bounds for resultants of univariate and bivariate polynomials

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds for resultants of univariate and bivariate polynomials

Article history: Received 23 August 2008 Accepted 3 August 2009 Available online xxxx Submitted by V. Olshevsky AMS classification: 11C20 11S05 15A60 13F20

متن کامل

Cayley-Dixon construction of Resultants of Multi-Univariate Composed Polynomials

The Cayley-Dixon formulation for multivariate resultants have been shown to be efficient (both experimentally and theoretically) for computing resultants by simultaneously eliminating many variables from a polynomial system. In this paper, the behavior of Cayley-Dixon resultant construction and the structure of Dixon matrices is analyzed for composed polynomial systems constructed from a multiv...

متن کامل

Implicitization using univariate resultants

Among several implicitization methods, the method based on resultant computation is a simple and direct one, but it often brings extraneous factors which are difficult to remove. This paper studies a class of rational space curves and rational surfaces by implicitization with univariate resultant computations. This method is more efficient than the other algorithms in finding implicit equations...

متن کامل

On Bounds For The Zeros of Univariate Polynomials

Problems on algebraical polynomials appear in many fields of mathematics and computer science. Especially the task of determining the roots of polynomials has been frequently investigated. Nonetheless, the task of locating the zeros of complex polynomials is still challenging. In this paper we deal with the location of zeros of univariate complex polynomials. We prove some novel upper bounds fo...

متن کامل

Lower bounds for univariate polynomials : a Wronskian approach

This is the nal report of an internship in algebraic complexity. First, we give an introduction to algebraic complexity and we give some motivations for the study of the main model. Then we present two di erent tools we studied during this internship and use them to establish some lower bounds on this model. We nally discuss whether those bounds could be improved or not.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2010

ISSN: 0024-3795

DOI: 10.1016/j.laa.2009.08.012